Implementing Joint Fixpoint Semantics on Top of DLV
نویسندگان
چکیده
In this paper we propose an implementation of the joint fixpoint semantics on top of the DLV system. Our framework provides a front-end to compromise logic programs (COLPs) representing agents’ requirements or desires in a multi-agent environment. By exploiting a direct mapping from COLP programs to classic logic programs we compute COLPs’ joint fixpoints modeling a common agreement among agents. Moreover an option is provided for computing minimal joint fixpoints in order to deal with situations where minimality is an issue to be consid-
منابع مشابه
On Implementing Structured Document Query Facilities on Top of a DOOD
The paper consists of two parts. In the first part we introduce a model for structured document databases where we propose Booleanvalued attribute grammars (BAGs) as a query facility. In the second part we show that DOOD technology offers a natural platform on top of which this model as a whole can be conveniently implemented. Each structured document database is mapped to an OO-database and ea...
متن کاملCooperating Answer Set Programming
We present a formalism for logic program cooperation based on the answer set semantics. The system consists of independent logic programs that are connected via a sequential communication channel. When presented with an input set of literals from its predecessor, a logic program computes its output as an answer set of itself, enriched with the input. It turns out that the communication strategy...
متن کاملMultiagent Compromises and Joint Fixpoint Semantics
We assume the requirements or desi res of an agent are modeled by a logic program. In a multi-agent setting, a joint decision of the agents, reflecting a compromise of t he various requirements, corresponds to a suitable joint model of the respective logic programs. In this paper, an appropriate semantics for selecting joint models representing compromises is proposed: the joint fixpoint semant...
متن کاملSystem Description: DLV with Aggregates
DLV is an efficient Answer Set Programming (ASP) system implementing the (consistent) answer set semantics [GL91] with various language extensions like weak constraints [BLR00], queries, and built-in predicates. A strong point of DLV is the high expressiveness of its language, which is able to express very complex problems, even problems which are hard for the complexity class . The language of...
متن کاملOn the Problem of Computing the Well-Founded Semantics
The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|×size(P)) steps, where size(P) denotes the total number of occurrences of atoms in a logic program P. This bound is achieved by an algorithm introduced by Van Gelder an...
متن کامل